Structured backward error analysis of linearized structured polynomial eigenvalue problems
نویسندگان
چکیده
منابع مشابه
Structured Backward Error Analysis of Linearized Structured Polynomial Eigenvalue Problems
We start by introducing a new class of structured matrix polynomials, namely, the class of MA-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the classes of (skew-)symmetric, (anti-)palindromic, and alternating matrix polynomials. Then, we introduce the families of MAstructured strong block minima...
متن کاملStructured backward error for palindromic polynomial eigenvalue problems
A detailed structured backward error analysis for four kinds of Palindromic Polynomial Eigenvalue Problems (PPEP) ( d ∑ l=0 Alλ l ) x = 0, Ad−l = εA ⋆ l for l = 0, 1, . . . , ⌊d/2⌋, where ⋆ is one of the two actions: transpose and conjugate transpose, and ε ∈ {±1}. Each of them has its application background with the case ⋆ taking transpose and ε = 1 attracting a great deal of attention lately ...
متن کاملStructured Eigenvalue Condition Number and Backward Error of a Class of Polynomial Eigenvalue Problems
We consider the normwise condition number and backward error of eigenvalues of matrix polynomials having ⋆-palindromic/antipalindromic and ⋆-even/odd structure with respect to structure preserving perturbations. Here ⋆ denotes either the transpose T or the conjugate transpose ∗. We show that when the polynomials are complex and ⋆ denotes complex conjugate, then to each of the structures there c...
متن کاملStructured Backward Error and Condition of Generalized Eigenvalue Problems
Backward errors and condition numbers are defined and evaluated for eigenvalues and eigenvectors of generalized eigenvalue problems. Both normwise and componentwise measures are used. Unstructured problems are considered first, and then the basic definitions are extended so that linear structure in the coefficient matrices (for example, Hermitian, Toeplitz, Hamiltonian, or band structure) is pr...
متن کاملBackward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization
One of the most frequently used techniques to solve polynomial eigenvalue problems is linearization, in which the polynomial eigenvalue problem is turned into an equivalent linear eigenvalue problem with the same eigenvalues, and with easily recoverable eigenvectors. The eigenvalues and eigenvectors of the linearization are usually computed using a backward stable solver such as the QZ algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2018
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3360